Lecture 5: k-wise Independent Hashing and Applications
نویسندگان
چکیده
If the random variables X1, X2, · · · , Xn are independent, they are k-wise independent for any k. However, the converse is not true as shown by the following example. Also, if k1 > k2, k1-wise independence implies k2-wise independence. Example 2. Let X1, X2 be uniform independent random variables taking values in {0, 1}. Let X3 = X1 ⊕X2. It is easy to check that {X1, X2, X3} is pairwise independent, but not independent.
منابع مشابه
Lecture 10 — March 20 , 2012
In the last lecture, we finished up talking about memory hierarchies and linked cache-oblivious data structures with geometric data structures. In this lecture we talk about different approaches to hashing. First, we talk about different hash functions and their properties, from basic universality to k-wise independence to a simple but effective hash function called simple tabulation. Then, we ...
متن کاملMin-wise independent sampling from skewed data streams
Min-wise independent hashing is a powerful sampling technique for estimating the similarity between sets. In particular, it has proved to be ubiquitous for mining data streams of large volume where the input sets are revealed in arbitrary order and the elements in a given set do not arrive consecutively. More precisely, for sets of elements E and attributes A the input is a stream of element-at...
متن کاملRecursive Hashing and One-Pass, One-Hash n-Gram Count Estimation
Many applications use sequences of n consecutive symbols (n-grams). We review n-gram hashing and prove that recursive hash families are pairwise independent at best. We prove that hashing by irreducible polynomials is pairwise independent whereas hashing by cyclic polynomials is quasi-pairwise independent: we make it pairwise independent by discarding n− 1 bits. One application of hashing is to...
متن کاملLinear Probing with 5-wise Independence
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms for storing (key,value) pairs. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analyses rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free...
متن کاملLower bounds on $q$-wise independence tails and applications to min-entropy condensers
We present novel and sharp lower bounds for higher load moments in the classical problem of mapping M balls into N bins by q-universal hashing, specialized to the case when M = N . As a corollary we prove a tight counterpart for the result about min-entropy condensers due to Dodis, Pietrzak and Wichs (CRYPTO’14), which has found important applications in key derivation. It states that condensin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013